Cramér-Rao Bound for Estimation After Model Selection and Its Application to Sparse Vector Estimation
نویسندگان
چکیده
In many practical parameter estimation problems, such as coefficient of polynomial regression, the true model is unknown and thus, a selection step performed prior to estimation. The data-based affects subsequent particular, oracle Cramér-Rao bound (CRB), which based on knowledge model, inappropriate for post-model-selection performance analysis system design outside asymptotic region. this paper, we investigate vector with an support set, where set represents model. We analyze coherent estimators that force unselected parameters zero. use mean-squared-selected-error (MSSE) criterion introduce concept selective unbiasedness in sense Lehmann unbiasedness. derive non-Bayesian Cramér-Rao-type MSSE mean-squared-error (MSE) any estimator specific selective-bias function sense. implement CRB special case sparse set. Finally, demonstrate simulations proposed informative lower maximum selected likelihood general linear generalized information one thresholding. It shown these cases outperforms Sando-Mitra-Stoica (SMS-CRB) [1].
منابع مشابه
The Cramér-Rao bound for estimation-after-selection
In many practical parameter estimation problems, a model selection is made prior to estimation. In this paper, we consider the problem of estimating an unknown parameter of a selected population, where the population is chosen from a population set by using a predetermined selection rule. Since the selection step may have an important impact on subsequent estimation, ignoring it could lead to b...
متن کاملCramér-Rao bound for range estimation
In this paper, we derive the Cramér-Rao bound (CRB) for range estimation, which does not only exploit the range information in the time delay, but also in the amplitude of the received signal. This new bound is lower than the conventional CRB that only makes use of the range information in the time delay. We investigate the new bound in an additive white Gaussian noise (AWGN) channel with atten...
متن کاملThe Cramér-Rao bound for estimating a sparse parameter vector
The goal of this contribution is to characterize the best achievable mean-squared error (MSE) in estimating a sparse deterministic parameter from measurements corrupted by Gaussian noise. To this end, an appropriate definition of bias in the sparse setting is developed, and the constrained Cramér–Rao bound (CRB) is obtained. This bound is shown to equal the CRB of an estimator with knowledge of...
متن کاملA constrained hybrid Cramér-Rao bound for parameter estimation
In statistical signal processing, hybrid parameter estimation refers to the case where the parameters vector to estimate contains both non-random and random parameters. Numerous works have shown the versatility of deterministic constrained Cramér-Rao bound for estimation performance analysis and design of a system of measurement. However in many systems both random and non-random parameters may...
متن کاملThe Cramer-Rao Bound for Sparse Estimation
The goal of this paper is to characterize the best achievable performance for the problem of estimating an unknown parameter having a sparse representation. Specifically, we consider the setting in which a sparsely representable deterministic parameter vector is to be estimated from measurements corrupted by Gaussian noise, and derive a lower bound on the mean-squared error (MSE) achievable in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2021
ISSN: ['1053-587X', '1941-0476']
DOI: https://doi.org/10.1109/tsp.2021.3068356